TSTP Solution File: GRA031^2 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : GRA031^2 : TPTP v8.1.2. Released v3.6.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 00:00:38 EDT 2023

% Result   : Timeout 299.82s 300.14s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : GRA031^2 : TPTP v8.1.2. Released v3.6.0.
% 0.00/0.11  % Command    : do_cvc5 %s %d
% 0.13/0.31  % Computer : n032.cluster.edu
% 0.13/0.31  % Model    : x86_64 x86_64
% 0.13/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31  % Memory   : 8042.1875MB
% 0.13/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31  % CPULimit   : 300
% 0.13/0.31  % WCLimit    : 300
% 0.13/0.31  % DateTime   : Sun Aug 27 03:37:59 EDT 2023
% 0.13/0.31  % CPUTime    : 
% 0.16/0.40  %----Proving TH0
% 0.16/0.41  %------------------------------------------------------------------------------
% 0.16/0.41  % File     : GRA031^2 : TPTP v8.1.2. Released v3.6.0.
% 0.16/0.41  % Domain   : Graph Theory
% 0.16/0.41  % Problem  : R(3,5) <= 16
% 0.16/0.41  % Version  : Especial.
% 0.16/0.41  % English  :
% 0.16/0.41  
% 0.16/0.41  % Refs     : [Rad06] Radziszowski (2006), Small Ramsey Numbers
% 0.16/0.41  %          : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.16/0.41  % Source   : [Bro08]
% 0.16/0.41  % Names    :
% 0.16/0.41  
% 0.16/0.41  % Status   : Theorem
% 0.16/0.41  % Rating   : 1.00 v3.7.0
% 0.16/0.41  % Syntax   : Number of formulae    :    1 (   0 unt;   0 typ;   0 def)
% 0.16/0.41  %            Number of atoms       :    0 (   0 equ;   0 cnn)
% 0.16/0.41  %            Maximal formula atoms :    0 (   0 avg)
% 0.16/0.41  %            Number of connectives :  126 (  30   ~;   1   |;  37   &;  56   @)
% 0.16/0.41  %                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
% 0.16/0.41  %            Maximal formula depth :   45 (  45 avg)
% 0.16/0.41  %            Number of types       :    1 (   0 usr)
% 0.16/0.41  %            Number of type conns  :   44 (  44   >;   0   *;   0   +;   0  <<)
% 0.16/0.41  %            Number of symbols     :    0 (   0 usr;   0 con; --- aty)
% 0.16/0.41  %            Number of variables   :   17 (   0   ^;   3   !;  14   ?;  17   :)
% 0.16/0.41  % SPC      : TH0_THM_NEQ_NAR
% 0.16/0.41  
% 0.16/0.41  % Comments : If a type alpha has exactly n elements, then we can prove
% 0.16/0.41  %            R(k,l) > n by finding a graph (symmetric binary relation) on type
% 0.16/0.41  %            alpha with no k-cliques and no l-independent sets. Likewise, we
% 0.16/0.41  %            can prove R(k,l) <= n by proving every graph (symmetric binary
% 0.16/0.41  %            relation) on alpha must have a k-clique or l-independent set.
% 0.16/0.41  %            There is one type with 4 elements: o > o. There are two types
% 0.16/0.41  %            with 16 elements: o > o > o and (o > o) > o. There are two types
% 0.16/0.41  %            with 256 elements: o > o > o > o and o > (o > o) > o.  This means
% 0.16/0.41  %            we always have two formulations of R(k,l) >/<= 16 and two
% 0.16/0.41  %            formulations of R(k,l) >/<= 256.
% 0.16/0.41  %          : 
% 0.16/0.41  %------------------------------------------------------------------------------
% 0.16/0.41  thf(ramsey_u_3_5_16a,conjecture,
% 0.16/0.41      ! [G: ( ( $o > $o ) > $o ) > ( ( $o > $o ) > $o ) > $o] :
% 0.16/0.41        ( ! [Xx: ( $o > $o ) > $o,Xy: ( $o > $o ) > $o] :
% 0.16/0.41            ( ( G @ Xx @ Xy )
% 0.16/0.41           => ( G @ Xy @ Xx ) )
% 0.16/0.41       => ( ? [Xx0: ( $o > $o ) > $o,Xx1: ( $o > $o ) > $o,Xx2: ( $o > $o ) > $o,Xp0: ( ( $o > $o ) > $o ) > $o,Xp1: ( ( $o > $o ) > $o ) > $o] :
% 0.16/0.41              ( ( Xp0 @ Xx0 )
% 0.16/0.41              & ~ ( Xp0 @ Xx1 )
% 0.16/0.41              & ~ ( Xp0 @ Xx2 )
% 0.16/0.41              & ~ ( Xp1 @ Xx0 )
% 0.16/0.41              & ( Xp1 @ Xx1 )
% 0.16/0.41              & ~ ( Xp1 @ Xx2 )
% 0.16/0.41              & ( G @ Xx1 @ Xx0 )
% 0.16/0.41              & ( G @ Xx2 @ Xx0 )
% 0.16/0.41              & ( G @ Xx2 @ Xx1 ) )
% 0.16/0.41          | ? [Xx0: ( $o > $o ) > $o,Xx1: ( $o > $o ) > $o,Xx2: ( $o > $o ) > $o,Xx3: ( $o > $o ) > $o,Xx4: ( $o > $o ) > $o,Xp0: ( ( $o > $o ) > $o ) > $o,Xp1: ( ( $o > $o ) > $o ) > $o,Xp2: ( ( $o > $o ) > $o ) > $o,Xp3: ( ( $o > $o ) > $o ) > $o] :
% 0.16/0.41              ( ( Xp0 @ Xx0 )
% 0.16/0.41              & ~ ( Xp0 @ Xx1 )
% 0.16/0.41              & ~ ( Xp0 @ Xx2 )
% 0.16/0.41              & ~ ( Xp0 @ Xx3 )
% 0.16/0.41              & ~ ( Xp0 @ Xx4 )
% 0.16/0.41              & ~ ( Xp1 @ Xx0 )
% 0.16/0.41              & ( Xp1 @ Xx1 )
% 0.16/0.41              & ~ ( Xp1 @ Xx2 )
% 0.16/0.41              & ~ ( Xp1 @ Xx3 )
% 0.16/0.41              & ~ ( Xp1 @ Xx4 )
% 0.16/0.41              & ~ ( Xp2 @ Xx0 )
% 0.16/0.41              & ~ ( Xp2 @ Xx1 )
% 0.16/0.41              & ( Xp2 @ Xx2 )
% 0.16/0.41              & ~ ( Xp2 @ Xx3 )
% 0.16/0.41              & ~ ( Xp2 @ Xx4 )
% 0.16/0.41              & ~ ( Xp3 @ Xx0 )
% 0.16/0.41              & ~ ( Xp3 @ Xx1 )
% 0.16/0.41              & ~ ( Xp3 @ Xx2 )
% 0.16/0.41              & ( Xp3 @ Xx3 )
% 0.16/0.41              & ~ ( Xp3 @ Xx4 )
% 0.16/0.41              & ~ ( G @ Xx1 @ Xx0 )
% 0.16/0.41              & ~ ( G @ Xx2 @ Xx0 )
% 0.16/0.41              & ~ ( G @ Xx2 @ Xx1 )
% 0.16/0.41              & ~ ( G @ Xx3 @ Xx0 )
% 0.16/0.41              & ~ ( G @ Xx3 @ Xx1 )
% 0.16/0.41              & ~ ( G @ Xx3 @ Xx2 )
% 0.16/0.41              & ~ ( G @ Xx4 @ Xx0 )
% 0.16/0.41              & ~ ( G @ Xx4 @ Xx1 )
% 0.16/0.41              & ~ ( G @ Xx4 @ Xx2 )
% 0.16/0.41              & ~ ( G @ Xx4 @ Xx3 ) ) ) ) ).
% 0.16/0.41  
% 0.16/0.41  %------------------------------------------------------------------------------
% 0.16/0.41  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.gSFr7uTm3a/cvc5---1.0.5_31171.p...
% 0.16/0.41  (declare-sort $$unsorted 0)
% 0.16/0.41  (assert (not (forall ((G (-> (-> (-> Bool Bool) Bool) (-> (-> Bool Bool) Bool) Bool))) (=> (forall ((Xx (-> (-> Bool /export/starexec/sandbox/solver/bin/do_THM_THF: line 35: 31308 Alarm clock             ( read result; case "$result" in 
% 299.82/300.14      unsat)
% 299.82/300.14          echo "% SZS status $unsatResult for $tptpfilename"; echo "% SZS output start Proof for $tptpfilename"; cat; echo "% SZS output end Proof for $tptpfilename"; exit 0
% 299.82/300.14      ;;
% 299.82/300.14      sat)
% 299.82/300.14          echo "% SZS status $satResult for $tptpfilename"; cat; exit 0
% 299.82/300.14      ;;
% 299.82/300.14  esac; exit 1 )
% 299.82/300.15  Bool) Bool)) (Xy (-> (-> Bool Bool) Bool))) (=> (@ (@ G Xx) Xy) (@ (@ G Xy) Xx))) (or (exists ((Xx0 (-> (-> Bool Bool) Bool)) (Xx1 (-> (-> Bool Bool) Bool)) (Xx2 (-> (-> Bool Bool) Bool)) (Xp0 (-> (-> (-> Bool Bool) Bool) Bool)) (Xp1 (-> (-> (-> Bool Bool) Bool) Bool))) (let ((_let_1 (@ G Xx2))) (and (@ Xp0 Xx0) (not (@ Xp0 Xx1)) (not (@ Xp0 Xx2)) (not (@ Xp1 Xx0)) (@ Xp1 Xx1) (not (@ Xp1 Xx2)) (@ (@ G Xx1) Xx0) (@ _let_1 Xx0) (@ _let_1 Xx1)))) (exists ((Xx0 (-> (-> Bool Bool) Bool)) (Xx1 (-> (-> Bool Bool) Bool)) (Xx2 (-> (-> Bool Bool) Bool)) (Xx3 (-> (-> Bool Bool) Bool)) (Xx4 (-> (-> Bool Bool) Bool)) (Xp0 (-> (-> (-> Bool Bool) Bool) Bool)) (Xp1 (-> (-> (-> Bool Bool) Bool) Bool)) (Xp2 (-> (-> (-> Bool Bool) Bool) Bool)) (Xp3 (-> (-> (-> Bool Bool) Bool) Bool))) (let ((_let_1 (@ G Xx4))) (let ((_let_2 (@ G Xx3))) (let ((_let_3 (@ G Xx2))) (and (@ Xp0 Xx0) (not (@ Xp0 Xx1)) (not (@ Xp0 Xx2)) (not (@ Xp0 Xx3)) (not (@ Xp0 Xx4)) (not (@ Xp1 Xx0)) (@ Xp1 Xx1) (not (@ Xp1 Xx2)) (not (@ Xp1 Xx3)) (not (@ Xp1 Xx4)) (not (@ Xp2 Xx0)) (not (@ Xp2 Xx1)) (@ Xp2 Xx2) (not (@ Xp2 Xx3)) (not (@ Xp2 Xx4)) (not (@ Xp3 Xx0)) (not (@ Xp3 Xx1)) (not (@ Xp3 Xx2)) (@ Xp3 Xx3) (not (@ Xp3 Xx4)) (not (@ (@ G Xx1) Xx0)) (not (@ _let_3 Xx0)) (not (@ _let_3 Xx1)) (not (@ _let_2 Xx0)) (not (@ _let_2 Xx1)) (not (@ _let_2 Xx2)) (not (@ _let_1 Xx0)) (not (@ _let_1 Xx1)) (not (@ _let_1 Xx2)) (not (@ _let_1 Xx3))))))))))))
% 299.82/300.15  (set-info :filename cvc5---1.0.5_31171)
% 299.82/300.15  (check-sat-assuming ( true ))
% 299.82/300.15  ------- get file name : TPTP file name is GRA031^2
% 299.82/300.15  ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_31171.smt2...
% 299.82/300.15  --- Run --ho-elim --full-saturate-quant at 10...
% 299.82/300.15  --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 299.82/300.15  --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 299.82/300.15  --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 299.82/300.15  --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 299.82/300.15  --- Run --no-ho-matching --full-saturate-quant --enum-inst-interleave --ho-elim-store-ax at 10...
% 299.82/300.15  --- Run --no-ho-matching --full-saturate-quant --macros-quant-mode=all at 10...
% 299.82/300.15  --- Run --ho-elim --full-saturate-quant --enum-inst-interleave at 10...
% 299.82/300.15  --- Run --no-ho-matching --full-saturate-quant --ho-elim-store-ax at 10...
% 299.82/300.15  --- Run --ho-elim --no-ho-elim-store-ax --full-saturate-quant...
% 299.82/300.15  % cvc5---1.0.5 exiting
% 299.82/300.15  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------